Termination Indicators in Programming

Distributed Termination Detection with Sticky State Indicators

Distributed termination detection is a \prototype problem" of the theory of distributed computing which has gained considerable interest in recent years. It is closely related to other important problems such as deadlock detection [CMH83, Na86], garbage collection [TTL88, TM90], and snapshot computation [CL85, Ma90]. The main purpose of this short note is not to introduce yet another distribute...

Non-termination in Unifying Theories of Programming

Within the Unifying Theories of Programming framework, program initiation and termination has been modelled by introducing a pair of variables in order to satisfy the required algebraic properties. We replace these variables with the improper value ⊥ that is frequently used to denote undefinedness. Both approaches are proved isomorphic using the relation calculus, and the existing operations an...

Characterisations of Termination in Logic Programming

The procedural interpretation of logic programs and queries is parametric to the selection rule, i.e. the rule that determines which atom is selected in each resolution step. Termination of logic programs and queries depends critically on the selection rule. In this survey, we present a unified view and comparison of seven notions of universal termination considered in the literature, and the c...

Termination Analysis for Tabled Logic Programming ( Extended

Termination Analysis for Tabled Logic Programming

The relative novelty of tabled-based logic programming implementations has given rise to a number of both theoretical and practical questions related to the study of the characteristics of such programs and to improving their performance. This work has been motivated by an initial study on how to adapt advanced program specialisation techniques, originally developed for standard logic programmi...